package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

import java.util.Arrays;

class Solution1129 {
    public int[] shortestAlternatingPaths(int n, int[][] redEdges, int[][] blueEdges) {
        return GraphUtils.shortestAlternatingPaths(n, redEdges, blueEdges);
    }
}

public class leetcode1129 {
    public static void main(String[] args) {
        Solution1129 solution1129 = new Solution1129();
        int[][] red_edges = {{0, 1}, {1, 2}};
        int[][] blue_edges = {};
        System.out.println(Arrays.toString(solution1129.shortestAlternatingPaths(3, red_edges, blue_edges)));
    }
}
